Unwarping of Slightly Distorted Periodic Structures Using Bidimensional Polynomial Representations
نویسندگان
چکیده
This paper describes a method to compensate for spatial distortion in quasi-periodic structures allowing a noise reduction by averaging. The successive steps of processing are preprocessing by local normalization, the detection of control points by cross-correlation, the estimation and compensation of the warping function using bidimensional polynomials, and finally noise reduction by filtering or accumulation. This method is applied to the improvement of high resolution images of thin sections of muscle fibers obtained by electron microscopy. Zu~ammenfassung. Dieser Beitrag beschreibt ein Verfahren, r/iumliche Verzerrungen in quasiperiodischen Strukturen zu kompensieren und iibedagertes Rauschen mit Hilfe einer Mittelwertbildung zu reduzieren. Die aufeinanderfolgenden Verarbeitungsschritte sind: Vorverarbeitung dutch Iokale Normalisierung, Detektion von Orientierungspunkten mit Hilfe der Kreuzkorrelation, Absch~itzung und Kompensation der Verzerrungsfunktion mit Hilfe zweidimensionaler Polynome, und schlieJ]lich die Reduktion des Rauschens durch Filterung oder Akkumulieren. Diese Methode wird dazu angewendet, die Qualit~it hochaufl6sender Bilder von diinnen Sektionen von Muskelfasern zu verbessern, die mit Hilfe eines Elektronenmikroskops gewonnen werden. R6sum6. Cet article d6crit une m6thode pour la compensation de d6formations spatiales pour des structures quasi-p6riodiques en vue d'une r6duction du bruit par cumulation. Le traitement comporte les 6tapes suivantes: le pr6traitement par normalisation locale, la d6tection par corr61ation de points de contr61e caract6risant la position des cellules de base, l'estimation et la compensation de la fonction de d6formation par l'interm6diaire de polyn6mes bidimensionnels, et finalement la r6duction du bruit par filtrage ou cumulation. Cette technique est appliqu6e h l'am61ioration d'images de filaments musculaires obtenues par microscopic 61ectronique ~ tr~s haute r6solution.
منابع مشابه
EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملOmega Polynomial in Polybenzene Multi Tori
The polybenzene units BTX 48, X=A (armchair) and X=Z (zig-zag) dimerize forming “eclipsed” isomers, the oligomers of which form structures of five-fold symmetry, called multi-tori. Multi-tori can be designed by appropriate map operations. The genus of multi-tori was calculated from the number of tetrapodal units they consist. A description, in terms of Omega polynomial, of the two linearly peri...
متن کاملBattRAE: Bidimensional Attention-Based Recursive Autoencoders for Learning Bilingual Phrase Embeddings
In this paper, we propose a bidimensional attention based recursive autoencoder (BattRAE) to integrate cues and source-target interactions at multiple levels of granularity into bilingual phrase representations. We employ recursive autoencoders to generate tree structures of phrase with embeddings at different levels of granularity (e.g., words, sub-phrases, phrases). Over these embeddings on t...
متن کاملMatching Perspective Views of Coplanar Structures Using Projective Unwarping and Similarity Matching Matching Perspective Views of Coplanar Structures Using Projective Unwarping and Similarity Matching
We consider the problem of matching perspective views of coplanar structures composed of line segments. Both model-to-image and image-to-image correspondence matching are given a consistent treatment. These matching scenarios generally require discovery of an eight parameter projective mapping. However, when the horizon line of the object plane can be found in the image, done here using vanishi...
متن کاملNarumi-Katayama Polynomial of Some Nano Structures
The Narumi-Katayama index is the first topological index defined by the product of some graph theoretical quantities. Let G be a simple graph. Narumi-Katayama index of G is defined as the product of the degrees of the vertices of G. In this paper, we define the Narumi-Katayama polynomial of G. Next, we investigate some properties of this polynomial for graphs and then, we obtain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002